Complete subset regressions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complete Subset Regressions

This paper proposes a new method for combining forecasts based on complete subset regressions. For a given set of potential predictor variables we combine forecasts from all possible linear regression models that keep the number of predictors fixed. We explore how the choice of model complexity, as measured by the number of included predictor variables, can be used to trade off the bias and var...

متن کامل

Subset-Generated Complete Sublattices as Concept Lattices

We present a solution to the problem of finding the complete sublattice of a given concept lattice generated by given set of elements. We construct the closed subrelation of the incidence relation of the corresponding formal context whose concept lattice is equal to the desired complete sublattice. The construction does not require the presence of the original concept lattice. We introduce an e...

متن کامل

Column subset selection is NP-complete

Let M be a real r × c matrix and let k be a positive integer. In the column subset selection problem (CSSP), we need to minimize the quantity M − SA, where A can be an arbitrary k × c matrix, and S runs over all r × k submatrices of M. This problem and its applications in numerical linear algebra are being discussed for several decades, but its algorithmic complexity remained an open issue. We ...

متن کامل

Gini's Multiple Regressions Gini's Multiple Regressions

Two regression methods can be interpreted as based on Gini's mean difference (GMD). One relies on a weighted average of slopes defined between adjacent observations and the other is based on minimization of the GMD of the errors. The properties of the former approach are investigated in a multiple regression framework. These estimators have representations that resemble the OLS estimators, and ...

متن کامل

Complete tree subset difference broadcast encryption scheme and its analysis

The Subset Difference (SD) method proposed by Naor-Naor-Lotspeich is the most popular broadcast encryption (BE) scheme. It is suitable for real-time applications like Pay-TV. It has been suggested for use by the AACS standard for digital rights management in Blu-Ray and DVD discs. The SD method assumes the number of users to be a power of two. (1) We propose the Complete Tree Subset Difference ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Econometrics

سال: 2013

ISSN: 0304-4076

DOI: 10.1016/j.jeconom.2013.04.017